Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
نویسنده
چکیده
The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting is NP-complete; the data-complexity of both query-answering and finite query-answering for the two-variable guarded fragment with counting is co-NP-complete.
منابع مشابه
Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
We show that the satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
متن کاملComplexity of the Two-Variable Fragment with Counting Quantifiers
The satisfiability and finite satisfiability problems for the two-variable fragment of firstorder logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
متن کاملComplexity of the Guarded Two-Variable Fragment with Counting Quantifiers
We show that the finite satisfiability problem for the guarded twovariable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of the result obtained in Kazakov [6], that the satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.
متن کاملDecidable first-order modal logics with counting quantifiers
In this paper, we examine the computational complexity of various natural onevariable fragments of first-order modal logics with the addition of arbitrary counting quantifiers. The addition of counting quantifiers provides us a rich language with which to succinctly express statements about the quantity of objects satisfying a given property, using only a single variable. We provide optimal upp...
متن کاملComplexity and Expressivity of Uniform One-Dimensional Fragment with Equality
Uniform one-dimensional fragment UF=1 is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in the quantified formula. The fragment is closed under Boolean operations, but additional restrictions (called uniformity conditions) apply to combinations of atomic formulas ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 207 شماره
صفحات -
تاریخ انتشار 2009